Global communication algorithms for Cayley graphs
نویسنده
چکیده
We discuss several combinatorial problems that arise when one looks at computational algorithms for highly symmetric networks of processors. More specifically, we are interested in minimal times associated with four communication tasks (defined more precisely below): universal broadcast, every processor has a vector that it wishes to broadcast to all the others; universal accumulation, every processor wishes to receive the sum of all the vectors being sent to it by all the other processors; universal exchange, every processor wishes to exchange a vector with each other processor; and global summation, every processor wants the sum of the vectors in all the processors . §
منابع مشابه
Routing and Embeddings in Super Cayley Graphs
In this paper, we introduce super Cayley graphs, a class of communication-efficient networks for parallel processing. We show that super Cayley graphs can embed trees, meshes, hypercubes, as well as star, bubble-sort graphs, and transposition networks with constant dilation. We also show that algorithms developed for star graphs can be emulated on suitably constructed super Cayley graphs with a...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملGossiping in circulant graphs Gossiping in circulant graphs
ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.6349 شماره
صفحات -
تاریخ انتشار 2013